The connectivity index: an effective metric for grading epileptogenicity
نویسندگان
چکیده
منابع مشابه
An Effective Clustering Algorithm to Index High Dimensional Metric Spaces
A metric space consists of a collection of objects and a distance function deened among them, which satis-es the triangular inequality. The goal is to prepro-cess the set so that, given a set of objects and a query, retrieve those objects close enough to the query. The number of distances computed to achieve this goal is the complexity measure. The problem is very diicult in the so-called high-...
متن کاملAn Effective Approach for Robust Metric Learning in the Presence of Label Noise
Many algorithms in machine learning, pattern recognition, and data mining are based on a similarity/distance measure. For example, the kNN classifier and clustering algorithms such as k-means require a similarity/distance function. Also, in Content-Based Information Retrieval (CBIR) systems, we need to rank the retrieved objects based on the similarity to the query. As generic measures such as ...
متن کاملDAHC-tree: An Effective Index for Approximate Search in High-Dimensional Metric Spaces
Similarity search in high-dimensional metric spaces is a key operation in many applications, such as multimedia databases, image retrieval, object recognition, and others. The high dimensionality of the data requires special index structures to facilitate the search. A problem regarding the creation of suitable index structures for highdimensional data is the relationship between the geometry o...
متن کاملAn Effective Automated Grading System for HCC in Biopsy Images
Accurate grading for hepatocellular carcinoma (HCC) in biopsy images is important to prognosis and treatment planning. However, visual grading is always time-consuming, subjective, and inconsistent. In this paper, we proposed a novel approach to automatically classifying biopsy images into five grades. At first, a dual morphological reconstruction method was applied to remove noise and accentua...
متن کاملSome new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Neurosurgery
سال: 2020
ISSN: 0022-3085,1933-0693
DOI: 10.3171/2019.4.jns195